Solving the Parameter Identification Problem using Shuffled Frog Leaping with Opposition-Based Initialization

نویسندگان

  • Morteza Alinia Ahandani
  • Reza Banimahd
چکیده

The parameter identification problem can be modeled as a non-linear optimization problem. In this problem, some unknown parameters of a mathematical model presented by an ordinary differential equation using some experimental data must be estimated. This paper presents a shuffled frog leaping algorithm for solving parameter identification problem. An opposition-based initialization strategy is used to choose the fitter members as initial population. Two test cases are considered to examine the efficiency of utilized algorithm. The comparison results of shuffled frog leaping and other methods proposed in the different literature demonstrate that the shuffled frog leaping has a comparable performance than other evolutionary algorithms. Keywordsshuffled frog leaping; parameter identification problem; opposition-based initialization

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shuffled Frog-Leaping Programming for Solving Regression Problems

There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...

متن کامل

Opposition-based learning in shuffled frog leaping: An application for parameter identification

This paper proposes using the opposition-based learning (OBL) strategy in the shuffled frog leaping (SFL). The SFL divides a population into several memeplexes and then improves each memeplex in an evolutionary process. The OBL by comparing the fitness of an individual to its opposite and retaining the fitter one in the population accelerates search process. The objective of this paper is to in...

متن کامل

Combined Heat and Power Economic Dispatch using Improved Shuffled Frog Leaping Algorithm

Recently, Combined Heat and Power (CHP) systems have been utilized increasingly in power systems. With the addition penetration of CHP-based co-generation of electricity and heat, the determination of economic dispatch of power and heat becomes a more complex and challenging issue. The optimal operation of CHP-based systems is inherently a nonlinear and non-convex optimization problem with a lo...

متن کامل

An improved shuffled frog leaping algorithm and its application in 0-1 Knapsack Problem

0-1 knapsack problem is a typical NP complete problem. Shuffled frog leaping algorithm is applied successfully in many combinational optimization problems. Therefore, the paper introduces an improved shuffled frog leaping algorithm for solving 0-1 knapsack problem. It greatly reduces the searching time of shuffled frog leaping algorithm. It also effectively ameliorates the disadvantage of easil...

متن کامل

Using the Modified Shuffled Frog Leaping Algorithm for Optimal Sizing and location of Distributed Generation Resources for Reliability Improvement

Restructuring the recent developments in the power system and problems arising from construction as well as the maintenance of large power plants lead to increase in using the Distributed Generation (DG) resources. DG units due to its specifications, technology and location network connectivity can improve system and load point reliability indices. In this paper, the allocation and sizing of di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011